#include<bits/stdc++.h>
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define debug  freopen("in.txt","r",stdin),freopen("out.txt","w",stdout);
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 1e6+10;
const int mod = 11092019;
using namespace std;

string s;
int cnt[300];
ll dp[300][2];

ll solve(){
	ll ans = 0;
	dp[1][0] = 1,dp[1][1] = cnt[1];
	for(int i = 2;i<=26;i++){
		dp[i][1] = (dp[i-1][0] * cnt[i]%mod + dp[i-1][1] * cnt[i] %mod) %mod;
		dp[i][0] = (dp[i-1][0] + dp[i-1][1]) %mod;
	}
	return (dp[26][1] + dp[26][0])%mod;
}
int main(){
	// debug;
	ios;

	cin>>s;
	for(auto c:s) cnt[c-'a'+1]++;
	cout<<solve()<<'\n';

	
	return 0;
}
